Extended truss theory with simplex constraints

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nucleosynthesis constraints on an extended Jordan-Brans-Dicke theory.

In a natural extension of the Jordan{Brans{Dicke theory the scalar eld can couple much more strongly to dark than to visible matter. New limits on the coupling constants of the model are obtained from standard big{bang nucleosynthesis.

متن کامل

Planning the reconfiguration of grounded truss structures with truss climbing robots that carry truss elements Citation

In this paper we describe an optimal reconfiguration planning algorithm that morphs a grounded truss structure of known geometry into a new geometry. The plan consists of a sequence of paths to move truss elements to their new locations that generate the new truss geometry. The trusses are grounded and remain connected at all time. Intuitively, the algorithm grows gradually the new truss struct...

متن کامل

Reformulation with Integrity Constraints ( extended abstract )

In this paper we study the problem of reducing the evaluation costs of queries on finite databases in presence of integrity constraints, by designing and materializing views. Given a database schema, a set of queries defined on the schema, a set of integrity constraints, and a storage limit, to find a solution to this problem means to find a set of views that satisfies the storage limit, provid...

متن کامل

Entailment with Conditional Equality Constraints ( Extended

Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend equality constraints with a weak form of subtyping to allow for more accurate analyses. We give a complete complexity characterization of the various entailment problems for conditional equality constraints and for a nat...

متن کامل

Database Reformulation with Integrity Constraints (extended abstract)

In this paper we study the problem of reducing the evaluation costs of queries on finite databases in presence of integrity constraints, by designing and materializing views. Given a database schema, a set of queries defined on the schema, a set of integrity constraints, and a storage limit, to find a solution to this problem means to find a set of views that satisfies the storage limit, provid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Solids and Structures

سال: 2011

ISSN: 0020-7683

DOI: 10.1016/j.ijsolstr.2010.10.014